Multiwinner Approval Rules as Apportionment Methods
نویسندگان
چکیده
We establish a link between multiwinner elections and apportionment problems by showing how approval-based multiwinner election rules can be interpreted as methods of apportionment. We consider several multiwinner rules and observe that they induce apportionment methods that are well-established in the literature on proportional representation. For instance, we show that Proportional Approval Voting induces the D’Hondt method and that Monroe’s rule induces the largest remainder method. We also consider properties of apportionment methods and exhibit multiwinner rules that induce apportionment methods satisfying these properties.
منابع مشابه
Consistent Approval-Based Multi-Winner Rules
This paper is an axiomatic study of consistent approval-based multi-winner rules, i.e., voting rules that select a fixed-size group of candidates based on approval ballots. We introduce the class of counting rules, provide an axiomatic characterization of this class and, in particular, show that counting rules are consistent. Building upon this result, we axiomatically characterize three import...
متن کاملBribery as a Measure of Candidate Success: Complexity Results for Approval-Based Multiwinner Rules
We study the problem of bribery in multiwinner elections, for the case where the voters cast approval ballots (i.e., sets of candidates they approve) and the bribery actions are limited to: adding an approval to a vote, deleting an approval from a vote, or moving an approval within a vote from one candidate to the other. We consider a number of approval-based multiwinner rules (AV, SAV, GAV, RA...
متن کاملConditional and Sequential Approval Voting on Combinatorial Domains
Several methods exist for making collective decisions on a set of variables when voters possibly have preferential dependencies. None is based on approval voting. We define a family of rules for approval-based voting on combinatorial domains, where voters cast conditional approval ballots, allowing them to approve values of a variable conditionally on the values of other variables. We study thr...
متن کاملThe Complexity of Multiwinner Voting Rules with Variable Number of Winners
We consider the approval-based model of elections, and undertake a computational study of voting rules which select committees whose size is not predetermined. While voting rules that output committees with a predetermined number of winning candidates are quite well studied, the study of elections with variable number of winners has only recently been initiated by Kilgour [18]. This paper aims ...
متن کاملProperties of multiwinner voting rules
The goal of this paper is to propose and study properties of multiwinner voting rules (with a particular focus on rules based in some way on single-winner scoring rules). We consider, e.g., SNTV, Bloc, k-Borda, STV, and several variants of Chamberlin–Courant’s and Monroe’s rules, identify two natural approaches to defining multiwinner rules, and show that many of our rules can be captured by on...
متن کامل